On a Quickest Detection Problem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Quickest Transshipment Problem

A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...

متن کامل

Quickest Moving Object Detection

We present a general framework and method for simultaneous detection and segmentation of an object in a video that moves (or comes into view of the camera) at some unknown time in the video. The method is an online approach based on motion segmentation, and it operates under dynamic backgrounds caused by a moving camera or moving nuisances. The goal of the method is to detect and segment the ob...

متن کامل

A comprehensive survey on the quickest path problem

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal...

متن کامل

Quickest Detection in Multiple On-Off Processes

We consider the quickest detection of idle periods in multiple on-off processes. At each time, only one process can be observed, and the observations are random realizations drawn from two different distributions depending on the current state (on or off) of the chosen process. The objective is to catch an idle period in any of the on-off processes as quickly as possible subject to a reliabilit...

متن کامل

Decentralized quickest change detection

A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1967

ISSN: 0003-4851

DOI: 10.1214/aoms/1177698864